Divide and Conquer - Organizing Component-based Adaptation in Distributed Environments

نویسندگان

  • Ulrich Scholz
  • Romain Rouvoy
چکیده

This paper introduces a divide and conquer approach for organizing the adaptation of distributed applications in a potentially large number of interacting middleware instances. In such an environment, a centralistic and static adaptation reasoning i) is inadequate and ii) gives the same priority to all applications. The divide and conquer method aims at minimizing the interference between running applications, allowing users to weight the priority of applications, and organizing the adaptation and the reasoning about the adaptation in a decentralized and flexible way.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods

This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...

متن کامل

Optimizing Skeletal Stream Processing for Divide and Conquer

Algorithmic skeletons intend to simplify parallel programming by providing recurring forms of program structure as predefined components. We present a new distributed task parallel skeleton for a very general class of divide and conquer algorithms for MIMD machines with distributed memory. Our approach combines skeletal internal task parallelism with stream parallelism. This approach is compare...

متن کامل

Preliminary Result of Parallel Double Divide and Conquer

This paper shows a concept for parallelization of double Divide and Conquer and its preliminary result. For singular value decomposition, double Divide and Conquer was recently proposed. It first computes singular values by a compact version of Divide and Conquer. The corresponding singular vectors are then computed by twisted factorization. The speed and accuracy of double Divide and Conquer a...

متن کامل

Arbenz Parallel Divide and Conquer Algorithms for the Symmetric Tridiagonal

In this paper a new implementation of a divide and conquer algorithm will be considered. This algorithm, in contrast to the LAPACK algorithm, uses a diierent formulation of the update problem, and extended precision in order to maintain accuracy and orthogonality. Our Intel Paragon implementation shows, in contrast to the Hypercube implementation by Ipsen and Jessup 14], that good speedups can ...

متن کامل

Divide and Conquer Semantic Web with Modular Ontologies - A Brief Review of Modular Ontology Language Formalisms

Distributed data and knowledge base applications need ontology languages and tools that can support collaborative construction, sharing, and use of large ontologies. Modular ontology languages aim to address this challenge by providing language support for organizing complex ontologies into relatively independent modules, selective sharing of information among ontology modules, and reasoning wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ECEASST

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2008